Measuring Protein Structural Similarity by Maximum Common Edge Subgraphs
نویسندگان
چکیده
It is known that the function of a protein is determined by its structure. Thus, structural similarity between proteins plays an important role as a good predictor of functional similarity. Many methods focus on solving the protein structure alignment problem. In this paper, we propose a graph-based approach to measure the similarity of two proteins. We first transfer a protein into a labeled graph according to its secondary structures, chemical properties, and 3D topology. For two graphs, we then find their maximum common edge subgraph for measuring the structural similarity of the corresponding proteins. By using a practical technique, the maximum common edge subgraph of two graphs can be found efficiently. Finally, by a backtracking, we can find the common substructure of the given proteins. Experimental results show that our method outperforms the RMSD method. This graph-based approach provides a practical direction for measuring protein structural similarity.
منابع مشابه
RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
A new graph similarity calculation procedure is introduced for comparing labeled graphs. Given a minimum similarity threshold, the procedure consists of an initial screening process to determine whether it is possible for the measure of similarity between the two graphs to exceed the minimum threshold, followed by a rigorous maximum common edge subgraph (MCES) detection algorithm to compute the...
متن کاملSelf-Similarity of Graphs
An old problem raised independently by Jacobson and Schönheim asks to determine the maximum s for which every graph with m edges contains a pair of edge-disjoint isomorphic subgraphs with s edges. In this paper we determine this maximum up to a constant factor. We show that every m-edge graph contains a pair of edge-disjoint isomorphic subgraphs with at least c(m logm) edges for some absolute c...
متن کاملMaximum Δ-edge-colorable subgraphs of class II graphs
A graph G is class II, if its chromatic index is at least ∆ + 1. Let H be a maximum ∆-edge-colorable subgraph of G. The paper proves best possible lower bounds for |E(H)| |E(G)| , and structural properties of maximum ∆-edge-colorable subgraphs. It is shown that every set of vertex-disjoint cycles of a class II graph with ∆ ≥ 3 can be extended to a maximum ∆-edge-colorable subgraph. Simple graph...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملA Fast Algorithm for Large Common Connected Induced Subgraphs
We present a fast algorithm for finding large common subgraphs, which can be exploited for detecting structural and functional relationships between biological macromolecules. Many fast algorithms exist for finding a single maximum common subgraph. We show with an example that this gives limited information, motivating the less studied problem of finding many large common subgraphs covering dif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010